THE G/M/M QUEUE WITH FINITE WAITING ROOM.HOKSTAD P.1975; J. APPL. PROBABIL.; G.B.; DA. 1975; VOL. 12; NO 4; PP. 779-792; BIBL. 8 REF.Article

A QUEUEING MODEL WITH FINITE WAITING ROOM AND BLOCKING.KONHEIM IG; REISER M.1976; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1976; VOL. 23; NO 2; PP. 328-341; BIBL. 3 REF.Article

DIE GEMISCHTE WARTEORDNUNG IN BEDIENUNGSSYSTEMEN MIT BESCHRAENKTEM WARTERAUM. = ORDRES D'ATTENTE COMPOSES DANS LES SYSTEMES DE SERVICE A FILE D'ATTENTE LIMITEEZITEK F.1974; APL. MAT.; CESKOSL.; DA. 1974; VOL. 19; NO 2; PP. 90-100; ABS. TCHEQUE; BIBL. 7 REF.Article

BUSY CYCLE ON THE GI/M1 QUEUE WITH FINITE WAITING ROOM.ROSENLUND SI.1974; STUD. SCI. MATH. HUNGAR.; HONGR.; DA. 1974; VOL. 9; NO 3-4; PP. 347-354; BIBL. 4 REF.Article

QUEUING NETWORK MODELS OF PACKET SWITCHING NETWORKS. I: OPEN NETWORKSWONG JW; LAM SS.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 1; PP. 9-21; BIBL. 24 REF.Article

COMPARING MULTI-SERVER QUEUES WITH FINITE WAITING ROOMS. I: SOME NUMBER OF SERVERSSONDERMAN D.1979; ADV. APPL. PROBAB.; GBR; DA. 1979; VOL. 11; NO 2; PP. 439-447; BIBL. 17 REF.Conference Paper

A QUEUEING SYSTEM WITH RANDOM ADDITIONAL SERVICE FACILITYBIDHI SINGH K.1978; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1978; VOL. 12; NO 3; PP. 311-318; BIBL. 4 REF.Article

NETWORK COMPUTER MODELINGBOWDON EK.1972; IN: ASSOC. COMPUT. MACH. ANN. CONF. PROC. BOSTON, 1972; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1972; VOL. 1; PP. 254-264; BIBL. 1 P. 1/2Conference Proceedings

SIMULATION FOR PASSAGE TIMES IN CLOSED, MULTICLASS NETWORKS OF QUEUES WITH UNRESTRICTED PRIORITIESSHEDLER GS; SOUTHARD J.1982; PERFORMANCE EVALUATION; ISSN 0166-5316; NLD; DA. 1982; VOL. 2; NO 4; PP. 257-267; BIBL. 11 REF.Article

MODELES DE RESEAUX DE FILES D'ATTENTE AVEC PANNES = MODELS OF QUEUEING NETWORKS SUBJECT TO BREAKDOWNSMIKOU NOUFISSA.1981; ; FRA; DA. 1981; 159 P.; 30 CM; BIBL. DISSEM.; TH.: SCI./PARIS 11/1981/2530Thesis

EQUIVALENCE ET DECOMPOSITION DANS LES MODELES A FILES D'ATTENTE ET LEUR APPLICATION A L'EVALUATION DES PERFORMANCES DE SYSTEMES D'EXPLOITATION.BRANDWAJN A.1975; AO-CNRS-10936; FR.; DA. 1975; PP. (291P.); H.T. 4; BIBL. 27 P.; (THESE DOCT. SCI., SPEC. MATH., MENTION INF.; PARIS VI)Thesis

AN APPROXIMATION METHOD FOR OPEN RESTRICTED QUEUEING NETWORKSTAKAHASHI Y; MIYAHARA H; HASEGAWA T et al.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 594-602; BIBL. 10 REF.Article

COMPARING MULTI-SERVER QUEUES WITH FINITE WAITING ROOMS. II: DIFFERENT MEMBERS OF SERVERSSONDERMAN D.1979; ADV. APPL. PROBAB.; GBR; DA. 1979; VOL. 11; NO 2; PP. 448-455; BIBL. 14 REF.Conference Paper

A GENERATING FUNCTION APPROACH TO QUEUEING NETWORK ANALYSIS OF MULTIPROGRAMMED COMPUTERS.WILLIAMS AC; BHANDIWAD RA.1976; NETWORKS; U.S.A.; DA. 1976; VOL. 6; NO 1; PP. 1-22; BIBL. 9 REF.Article

A TANDEM QUEUEING MODEL OF A TIME-SHARING COMPUTING SYSTEMMCCREDIE JW JR.1972; IN: ASSOC. COMPUT. MACH. ANN. CONF. PROC. BOSTON, 1972; NEW YORK; ASSOC. COMPUT. MACH.; DA. 1972; VOL. 2; PP. 991-1000; BIBL. 13 REF.Conference Proceedings

THE DISTRIBUTION OF QUEUING NETWORK STATES AT INPUT AND OUTPUT INSTANTSSEVCIK KC; MITRANI I.1978; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT. RAPP. RECH.; FRA; DA. 1978; NO 307; PP. 1-18; ABS. FRE; BIBL. 19 REF.Serial Issue

ON A CLASS OF QUEUE DISCIPLINES.DUFKOVA V; ZITEK F.1975; APL. MAT.; CESKOSL.; DA. 1975; VOL. 20; NO 5; PP. 345-358; ABS. TCHEQUE; BIBL. 8 REF.Article

FORMAL AND SIMULATION MODELS FOR A PHLEBOTOMY STATION SERVICE SYSTEMWHITCOMB CC.1981; METHODS INF. MED.; ISSN 0026-1270; DEU; DA. 1981; VOL. 20; NO 2; PP. 76-79; ABS. GER; BIBL. 8 REF.Article

CLOSED EXPONENTIAL NETWORKS OF QUEUES WITH SATURATION: THE JACKSON-TYPE STATIONARY DISTRIBUTION AND ITS ASYMPTOTIC ANALYSISPITTEL B.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 4; PP. 357-378; BIBL. 24 REF.Article

PRODUCT FORM AND LOCAL BALANCE IN QUEUEING NETWORKS.MANI CHANDY K; HOWARD JH JR; TOWSLEY DF et al.1977; IN: MODELLING PERFORMANCE EVAL COMPUT. SYST. INT. WORKSHOP. PROC.; ISPRA; 1976; AMSTERDAM; NORTH-HOLLAND; DA. 1977; PP. 89-101; BIBL. 1 P. 1/2Conference Paper

ALGORITHME DE RESEAUX DE FILES D'ATTENTE FERMES B.C.M.P. ET HEURISTIQUES ASSOCIEES = CLOSED B.C.M.P. QUEUING NETWORKS ANALYSIS AND ASSOCIATED HEURISTICSDRIX PHILIPPE.1982; ; FRA; DA. 1982; 402 P.; 30 CM; BIBL. 31 REF.; TH. DOCT.-ING.: MATH. APPL./PARIS 6/1982Thesis

OPERATIONAL ANALYSIS OF QUEUEING NETWORKS.DENNING PJ; BUZEN JP.1977; IN: MODELLING PERFORMANCE EVAL. COMPUT. SYST. INT. SYMP. 3; BONN-BAD GODESBERG; 1977; AMSTERDAM; NORTH HOLLAND; DA. 1977; PP. 151-172; BIBL. 1 P. 1/2Conference Paper

A MARKOV-DECISION-CHAIN APPROACH TO A STOCHASTIC ASSIGNMENT PROBLEM.ALBRIGHT SC.1974; OPER. RES.; U.S.A.; DA. 1974; VOL. 22; NO 1; PP. 61-64; BIBL. 5 REF.Article

AN M/G/1 MODEL WITH FINITE WAITING ROOM IN WHICH A CUSTOMER REMAINS DURING PART OF SERVICE.ROSENLUND SI.1973; J. APPL. PROBABIL.; G.B.; DA. 1973; VOL. 10; NO 4; PP. 778-785; BIBL. 3 REF.Article

LIMITED SPACE HETEROGENEOUS QEUEING PROBLEMGOEL LR.1979; TRAB. ESTADIST. INVEST. OPER.; ESP; DA. 1979; VOL. 30; NO 2; PP. 63-72; BIBL. 7 REF.Article